Expression Decomposition in a Rely/Guarantee Context
نویسنده
چکیده
This paper describes a technique of expression decomposition which allows the use of rely/guarantee development rules that do not assume atomic expression evaluation. This decomposition provides a means of addressing the fact that the logical meaning of expressions relative to a single state and the semantic evaluation of expressions in a fine-grained concurrent language do not provide the same results; in particular, the former results in a single value whereas the latter can result in many possible values. Rely/guarantee development rules tend to depend on the logical meaning of expressions in cases where they are used; expression decomposition identifies where it is safe to do so, and provides some tools for where it is not.
منابع مشابه
Compositional Verification of a Lock-Free Stack with RGITL
This paper describes a compositional verification approach for concurrent algorithms based on the logic Rely-Guarantee Interval Temporal Logic (RGITL), which is implemented in the interactive theorem prover KIV. The logic makes it possible to mechanically derive and apply decomposition theorems for safety and liveness properties. Decomposition theorems for rely-guarantee reasoning, linearizabil...
متن کاملA Structural Proof of the Soundness of Rely/guarantee Rules
The challenge of finding compositional ways of (formally) developing concurrent programs is considerable. Various forms of rely and guarantee conditions have been used to record and reason about interference in ways which do indeed provide compositional development methods for such programs.This paper presents a new approach to justifying the soundness of rely/guarantee inference rules. The und...
متن کاملToward a Behavioral Decomposition for Context-Awareness and Continuity of Services
Many adaptative context-aware middleware exist and most of them rely on so-called vertical architectures that offer a functional decomposition for contextawareness. This architecture has a weak point: it does not allow the system handling both dynamics of the changing environment and applications. To avoid this, we propose an approach for context-awareness based on a behavioral decomposition, a...
متن کاملA structural proof of the soundness of rely/guarantee rules (revised)
Various forms of rely/guarantee conditions have been used to record and reason about interference in ways that provide compositional development methods for concurrent programs. This paper illustrates such a set of rules and proves their soundness. The underlying concurrent language allows fine-grained interleaving and nested concurrency; it is defined by an operational semantics; the proof tha...
متن کاملRely-Guarantee References for Refinement Types
Reasoning about side effects and aliasing is the heart of verifyingimperative programs. Unrestricted side effects through one refer-ence can invalidate assumptions about an alias. We present a newtype system approach to reasoning about safe assumptions in thepresence of aliasing and side effects, unifying ideas from referenceimmutability type systems and rely-guarantee progr...
متن کامل